Oddness, modularity, and exhaustification

نویسندگان

چکیده

According to the ‘grammatical account’, scalar implicatures are triggered by a covert exhaustification operator present in logical form. This account covers considerable empirical ground, but there is peculiar pattern that resists treatment given its usual implementation. The centers on odd assertions like #Most lions mammals and #Some Italians come from beautiful country, which seem trigger contexts where enriched readings conflict with information common ground. Magri (Nat Language Semant 17(3):245–297. https://doi.org/10.1007/s11050-009-9042-x , 2009; Pragmat 4(6):1–51. https://doi.org/10.3765/sp.4.6 2011) argues that, for these cases, basic grammatical approach has be supplemented stipulations obligatory based formal computations blind In this paper, I argue accounts of oddness should allow possibility felicitous call revision including explicit unusual beliefs such as Most not all Some Italy. To adequately cover similar propose Magri’s version Grammatical refined novel hypothesis triggers bifurcation between presupposed (the negated relevant alternatives) at-issue prejacent) content. explanation full pattern, cases proposals revise follows interaction content an independently motivated constraint accommodation. Finally, treating presupposition helps solve various independent puzzles faced extant accounts, motivates substantial standard overt exhaustifier only.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Sentences with exhaustification

(1) a. What did Mary eat? b. Mary ate a pizza. c. Mary ate a pizza and a calzone. As an answer, we can think of (1b) as being ruled out by (1c), because (1c) is more exhaustive, in the sense that it contains additional true information. A number of researchers (e.g., Kuno 1972, Atlas & Levinson 1981, Horn 1981, Szabolcsi 1981, É. Kiss 1998) have noted that exhaustification effects are not limit...

متن کامل

Weak oddness as an approximation of oddness and resistance in cubic graphs

We introduce weak oddness ωw, a new measure of uncolourability of cubic graphs, defined as the least number of odd components in an even factor. For every bridgeless cubic graph G, %(G) ≤ ωw(G) ≤ ω(G), where %(G) denotes the resistance of G and ω(G) denotes the oddness of G, so this new measure is an approximation of both oddness and resistance. We demonstrate that there are graphs G satisfying...

متن کامل

Small Snarks with Large Oddness

We estimate the minimum number of vertices of a cubic graph with given oddness and cyclic connectivity. We prove that a bridgeless cubic graph G with oddness ω(G) other than the Petersen graph has at least 5.41ω(G) vertices, and for each integer k with 2 6 k 6 6 we construct an infinite family of cubic graphs with cyclic connectivity k and small oddness ratio |V (G)|/ω(G). In particular, for cy...

متن کامل

Mandarin Particle DOU: A Pre-exhaustification Exhaustifier

This paper provides a uniform semantics to capture various functions of Mandarin particle dou, including the quantifier use, FCI-licenser use, and scalar marker use. I argue that dou is a presuppositional exhaustifier that operates on sub-alternatives and has a pre-exhaustification effect.

متن کامل

Free Choice and Exhaustification: an Account of Subtrigging Effects

The goal of this article is to explain the distribution and meaning of qualsiasi/qualunque in the examples in (1). Universal FC items will be analysed as indefinites (contra Dayal, 1998). Following Aloni (2002, to appear) and Kratzer and Shimoyama (2002), I will assume that indefinites induce sets of propositional alternatives. The interpretation of FC items like qualsiasi will further cruciall...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Natural Language Semantics

سال: 2021

ISSN: ['1572-865X', '0925-854X']

DOI: https://doi.org/10.1007/s11050-020-09172-w